A New Identification Scheme based on the Gap Diffie-Hellman Problem
نویسندگان
چکیده
We introduce a new identification scheme based on the Gap Diffie-Hellman problem. Our identification scheme makes use of the fact that the computational Diffie-Hellman problem is hard in the additive group of points of an elliptic curve over a finite field, on the other hand, the decisional Diffie-Hellman problem is easy in the multiplicative group of the finite field mapped by a bilinear map. We prove that this scheme is secure against active attacks if the Gap Diffie-Hellman problem is intractable. Finally, we analyze efficiency of the scheme comparing with other identification schemes.
منابع مشابه
An Improved Identification Scheme
M. Kim and K. Kim [1] introduce a new identification scheme based on the Gap Diffie-Hellman problem, and prove that the scheme is secure against active attacks if the Gap Diffie-Hellman problem is intractable. But, their identification scheme is NOT secure. In this paper, we give the reason that why the scheme is not secure, and we also modify the scheme such that the modified scheme is secure ...
متن کاملAttack on an Identification Scheme Based on Gap Diffie-Hellman Problem
In [KK], a new identification scheme based on the Gap Diffie-Hellman problem was proposed at SCIS 2002, and it is shown that the scheme is secure against active attacks under the Gap Diffie-Hellman Intractability Assumption. Paradoxically, this identification scheme is totally breakable under passive attacks. In this paper, we show that any adversary holding only public parameters of the scheme...
متن کاملA Zero-Knowledge Identification Scheme in Gap Diffie-Hellman Groups
The Weil [10] and Tate pairings are bilinear maps defined on elliptic curves. They became popular for the design of new schemes since Joux’s tripartite key exchange [8]. When used with specific classes (supersingular and MNT [11]) of curves, they can be computed very efficiently. The existence of pairings gives rise to a new class of problems on these curves, such as the Bilinear Diffie-Hellman...
متن کاملEfficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups
This paper proposes a new public key authenticated encryption (signcryption) scheme based on the Diffie-Hellman problem in Gap Diffie-Hellman groups. This scheme is built on the scheme proposed by Boneh, Lynn and Shacham in 2001 to produce short signatures. The idea is to introduce some randomness into this signature to increase its level of security in the random oracle model and to re-use tha...
متن کاملEfficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme
We propose a robust proactive threshold signature scheme, a multisignature scheme and a blind signature scheme which work in any Gap Diffie-Hellman (GDH) group (where the Computational Diffie-Hellman problem is hard but the Decisional Diffie-Hellman problem is easy). Our constructions are based on the recently proposed GDH signature scheme of Boneh et al. [BLS]. Due to the instrumental structur...
متن کامل